Fast and Accurate Redistancing by Directional Optimization

نویسندگان

  • Matthew Elsey
  • Selim Esedoglu
چکیده

A fast and accurate algorithm for the reinitialization of the signed distance function in two and three spatial dimensions is presented. The algorithm has computational complexity O(N logN) for the reinitialization of N grid points. The order of accuracy of the reinitialization is demonstrated to depend primarily on the interpolation algorithm used. Bicubic interpolation is demonstrated to result in fourth-order accuracy for smooth interfaces. Simple numerical examples demonstrating the convergence and computational complexity of the reinitialization algorithm in two and three dimensions are presented as verification of the algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Dogleg Severity in Directional Drilling Oil Wells Using Particle Swarm Algorithm (Short Communication)

The dogleg severity is one of the most important parameters in directional drilling. Improvement of these indicators actually means choosing the best conditions for the directional drilling in order to reach the target point. Selection of high levels of the dogleg severity actually means minimizing well trajectory, but on the other hand, increases fatigue in drill string, increases torque and d...

متن کامل

An Accurate and Robust Finite Element Level Set Redistancing Method

A new redistancing method for piecewise polynomial finite element level set functions is introduced. The method directly computes the distance to the implicitly given discrete level set. Rigorous error bounds and numerical experiments are provided. Both show that, up to constants, the method is as good as the nodal interpolation of the computationally unavailable signed distance function of the...

متن کامل

PSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION

Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...

متن کامل

Marker Redistancing/Level Set Method for High-Fidelity Implicit Interface Tracking

A hybrid of the front tracking (FT) and the level set (LS) methods is introduced, combining advantages and removing drawbacks of both methods. The kinematics of the interface is treated in a Lagrangian (FT) manner, by tracking markers placed at the interface. The markers are not connected—instead, the interface topology is resolved in an Eulerian (LS) framework, by wrapping a signed distance fu...

متن کامل

Accelerated redistancing for level set-based process simulations with the fast iterative method

The finite iterative method is compared to an industry-hardened fast marching method for accelerating the redistancing step essential for Level Set-based process simulations in the area of technology computer-aided design. We discuss our implementation of the finite iterative method and depict extensions to improve the method for process simulations, in particular regarding stability. Contrary ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2014